Repeated Games and Qualitative Differential Games: Approachability and Comparison of Strategies
نویسندگان
چکیده
We study the notion of approachability in a repeated game with vector payoffs from a new point of view using techniques recently developed for qualitative differential games. Namely, we relate the sufficient condition for approachability (B-set) to the notion of discriminating domain for a suitably chosen differential game. The other goal of the present article is to obtain a new precise link between the strategies in the differential game and in the repeated game preserving approachability properties.
منابع مشابه
Zero-Sum Repeated Games: Recent Advances and New Links with Differential Games
The purpose of this survey is to describe some recent advances in zero-sum repeated games and in particular new connections to differential games. Topics include: approachability, asymptotic analysis: recursive formula and operator approach, dual game and incomplete information, uniform approach.
متن کاملRobust approachability and regret minimization in games with partial monitoring
Approachability has become a standard tool in analyzing learning algorithms in the adversarial online learning setup. We develop a variant of approachability for games where there is ambiguity in the obtained reward that belongs to a set, rather than being a single vector. Using this variant we tackle the problem of approachability in games with partial monitoring and develop simple and efficie...
متن کاملApproachability in Stackelberg Stochastic Games with Vector Costs
The notion of approachability was introduced by Blackwell [1] in the context of vector-valued repeated games. The famous ‘Blackwell’s approachability theorem’ prescribes a strategy for approachability, i.e., for ‘steering’ the average vector cost of a given agent towards a given target set, irrespective of the strategies of the other agents. In this paper, motivated by the multi-objective optim...
متن کاملA Learning Scheme for Approachability in MDPs and Stackelberg Stochastic Games
The notion of approachability was introduced by Blackwell [1] in the context of vector-valued repeated games. The famous ‘Blackwell’s approachability theorem’ prescribes a strategy for approachability, i.e., for ‘steering’ the average vector cost of a given agent towards a given target set, irrespective of the strategies of the other agents. In this paper, motivated by the multi-objective optim...
متن کاملA Learning Scheme for Blackwell’s Approachability in MDPs and Stackelberg Stochastic Games
The notion of approachability was introduced by Blackwell ([8]) in the context of vector-valued repeated games. The famous ‘Blackwell’s approachability theorem’ prescribes a strategy for approachability, i.e., for ‘steering’ the average vector-cost of a given player towards a given target set, irrespective of the strategies of the other players. In this paper, motivated from the multi-objective...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM J. Control and Optimization
دوره 48 شماره
صفحات -
تاریخ انتشار 2009